5 D ec 2 01 2 Threshold Digraphs ∗
نویسندگان
چکیده
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be equivalent. One of the characterizations is new, and allows for a shorter proof of the equivalence of the two known characterizations as well as proving the final characterization which appears without proof in the literature. Using this result, we obtain a new, short proof of the Fulkerson-Chen theorem on degree sequences of general digraphs.
منابع مشابه
Pushing vertices in digraphs without long induced cycles
Given a digraph D and a subset X of vertices of D, pushing X in D means reversing the orientation of all arcs with exactly one end in X. It is known that the problem of deciding whether a given digraph can be made acyclic using the push operation is NP-complete for general digraphs, and polynomial time solvable for multipartite tournaments. Here, we continue the study of deciding whether a digr...
متن کاملEfficiently Decodable Non-Adaptive Threshold Group Testing
X iv :1 71 2. 07 50 9v 2 [ cs .I T ] 2 3 D ec 2 01 7 Efficiently Decodable Non-Adaptive Threshold Group Testing Thach V. Bui∗, Minoru Kuribayashi‡, Mahdi Cheraghchi§, and Isao Echizen∗† ∗SOKENDAI (The Graduate University for Advanced Studies), Hayama, Kanagawa, Japan [email protected] ‡Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan [email protected] ...
متن کاملA note on the Roman domatic number of a digraph
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
متن کاملar X iv : 1 31 2 . 46 85 v 1 [ m at h . R A ] 1 7 D ec 2 01 3 EVOLUTION ALGEBRAS AND GRAPHS
A digraph is attached to any evolution algebra. This graph leads to some new purely algebraic results on this class of algebras and allows for some new natural proofs of known results. Nilpotency of an evolution algebra will be proved to be equivalent to the nonexistence of oriented cycles in the graph. Besides, the automorphism group of any evolution algebra E with E = E will be shown to be al...
متن کاملec 2 01 5 Multi - threshold Accelerate Failure Time Model
A two-stage procedure for simultaneously detecting multiple thresholds and achieving model selection in the segmented accelerate failure time (AFT) model is developed in this paper. In the first stage, we formulate the threshold problem as a group model selection problem so that a concave 2-norm group selection method can be applied. In the second stage, the thresholds are finalized via a refin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012